package com.yjc.dp;

/**
 * LCR 127. 跳跃训练
 *
 * @author yjc
 * @create 2024-07-23 14:53
 */
public class Subject_7 {
    public static void main(String[] args) {
        int num = 0;
        int[] dp = new int[num + 1];

        //初始化
        dp[0] = 1;

        for (int i = 1; i <= num; i++) {
            if (i == 1) {//只有一个格子时，解法只有一种
                dp[i] = dp[i - 1];
                continue;
            }

            //核心
            dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
        }
        System.out.println(dp[num]);
    }
}
